THE TEMPLATE PROGRAMMING OF PARALLEL ALGORITHMS

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Views on template-based parallel programming

For almost a decade we have been working at developing and using template-based models for coarse-grained parallel computing. Our initial system, FrameWorks, was positively received but had a number of shortcomings. The Enterprise parallel programming environment evolved out of this work, and now, after several years of experience with the system, its shortcomings are becoming evident. This pap...

متن کامل

Efficient Parallel Algorithms for Template Matching

The parallel complexity of template matching has been well studied. In this paper we present more work-eÆcient algorithms than the existing ones. Our algorithms are based on FFT primitives. We consider the following models of computing: PRAM and the hypercube.

متن کامل

Programming with the HPC++ Parallel Standard Template Library

We present an overview of the HPC++ Parallel Standard Template Library (PSTL), a parallel version of the C++ Standard Template Library (STL). The PSTL is part of HPC++, a C++ library and language extension framework being developed by the HPC++ consortium as a standard model for portable parallel programming in C++. The PSTL includes distributed versions of the seven STL containers (vector, lis...

متن کامل

The HPCVL Working Template: A Development Tool for Parallel Programming

This manual explains the structure and usage of the HPCVL Working Template for parallel programming that was developed by Gang Liu. The HPCVL Working Template (in the following abbreviated to HWT) is a set of scripts and routines that provide a simple and portable tool for version maintenance, timing and automatic relative debugging of programs that are designed to run on parallel computers. Th...

متن کامل

Asynchronous Analysis of Parallel Dynamic Programming Algorithms

We examine a very simple asynchronous model of parallel computation that assumes the time to compute a task is random, following some probability distribution. The goal of this model is to capture the eeects of unpredictable delays on processors, due to communication delays or cache misses, for example. Using techniques from queueing theory and occupancy problems, we use this model to analyze t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical Modelling and Analysis

سال: 2002

ISSN: 1392-6292,1648-3510

DOI: 10.3846/13926292.2002.9637173